n, k = map(int, input().split())
s = input().strip('.#')
dist = len(s) - 1
print('NO' if dist % k or '#' in s[0:dist:k] else 'YES')
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
int n, k;
cin >> n >> k;
string s;
cin >> s;
int num = 0;
char c = 'a';
for (int i = 0; i < s.size(); i++)
{
if (s[i] == 'G' || s[i] == 'T')
{
num = i;
c = s[i];
break;
}
}
for (int i = num; i < s.size(); i += k)
{
if (s[i] != c)
if (s[i] == 'G' || s[i] == 'T')
{
cout << "YES";
return 0;
}
if (s[i] == '#')
{
cout << "NO";
return 0;
}
}
cout << "NO";
}
145. Binary Tree Postorder Traversal | 94. Binary Tree Inorder Traversal |
101. Symmetric Tree | 77. Combinations |
46. Permutations | 226. Invert Binary Tree |
112. Path Sum | 1556A - A Variety of Operations |
136. Single Number | 169. Majority Element |
119. Pascal's Triangle II | 409. Longest Palindrome |
1574A - Regular Bracket Sequences | 1574B - Combinatorics Homework |
1567A - Domino Disaster | 1593A - Elections |
1607A - Linear Keyboard | EQUALCOIN Equal Coins |
XOREQN Xor Equation | MAKEPAL Weird Palindrome Making |
HILLSEQ Hill Sequence | MAXBRIDGE Maximise the bridges |
WLDRPL Wildcard Replacement | 1221. Split a String in Balanced Strings |
1002. Find Common Characters | 1602A - Two Subsequences |
1555A - PizzaForces | 1607B - Odd Grasshopper |
1084A - The Fair Nut and Elevator | 1440B - Sum of Medians |